A genetic algorithm for shortest path with real constraints in computer networks

<span lang="EN-US">The shortest path problem has many different versions. In this manuscript, we proposed a muti-constrained optimization method to find the in computer network. general, genetic algorithm is one of common heuristic algorithms. paper, employed solution multi-constrained problem. The finds best route for network packets with minimum total cost, delay, and hop count constrained limited bandwidth. new was implemented on four capacity networks random parameters, results showed that under constraints can be found reasonable time. experimental always minimal constraints.</span>